Online balanced graph avoidance games
نویسندگان
چکیده
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are introduced two at the time, in a random order. For each pair of edges, Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid creating a monochromatic copy of a small fixed graph F for as long as possible. We show that the duration of the game is determined by a threshold function mH = mH(n) for certain graph-theoretic structures, e.g., cycles. That is, for every graph H in this family, Painter will asymptotically almost surely (a.a.s.) lose the game after m = ω(mH) edge pairs in the process. On the other hand, there exists an essentially optimal strategy: if the game lasts for m = o(mH) moves, Painter can a.a.s. successfully avoid monochromatic copies of H. Our attempt is to determine the threshold function for several classes of graphs.
منابع مشابه
Balanced Avoidance Games on Random Graphs
We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are revealed two at a time in a random order. In each move, Painter immediately and irrevocably decides on a balanced coloring of the new edge pair: either the first edge is colored red and the second one blue or vi...
متن کاملرابطه اجتناب تجربه ای، جو عاطفی خانواده و خودکنترلی با اعتیاد به بازی های آنلاین در دانشجویان دانشگاه شهید چمران اهواز
Background and Objectives: online game addiction is considered as a compulsive, excessive, uncontrollable and destructive physical and psychological behavior. With regard to the problem of persons with addiction to online gaming in the fields of experiential avoidance, families emotional atmosphere and self-control, this study was carried out with the aim of determining the relationship of expe...
متن کاملOffline thresholds for Ramsey-type games on random graphs
In this paper, we compare the offline versions of three Ramsey-type oneplayer games that have been studied in an online setting in previous work: the online Ramsey game, the balanced online Ramsey game, and the Achlioptas game. The goal in all games is to color the edges of the random graph Gn,m according to certain rules without creating a monochromatic copy of some fixed forbidden graph H. Wh...
متن کاملGraph Ramsey games
We consider combinatorial avoidance and achievement games based on graph Ramsey theory: The players take turns in coloring still uncolored edges of a graph G, each player being assigned a distinct color, choosing one edge per move. In avoidance games, completing a monochromatic subgraph isomorphic to another graph A leads to immediate defeat or is forbidden and the first player that cannot move...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007